Tabulation for Multi-Purpose Partial Parsing

نویسندگان

  • Vitor Rocio
  • José Gabriel Pereira Lopes
  • Éric Villemonte de la Clergerie
چکیده

E cient partial parsing systems chunkers are urgently required by various natural language application areas as these parsers always produce partially parsed text even when the text does not fully t existing lexica and grammars Availability of partially parsed corpora is absolutely necessary for extracting various kinds of information that may then be fed into those systems increasing their processing power In this paper we propose an e cient partial parsing scheme based on chart parsing that is exible enough to support both normal parsing tasks and diagnosis in previously obtained partial parses of possible causes kinds of faults that led to those partial parses instead of complete parses Through the use of the built in tabulation capabilites of the DyALog system we implemented a partial parser that runs as fast as the best non deterministic parsers In this paper we ellaborate on the implementation of two di erent grammar formalisms De nite Clause Grammars DCG extended with head declarations and Bound Movement Grammars BMG

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tabulation of Automata for Tree-Adjoining Languages

We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the mechanism of tabulation. The parsing strategy is expressed in terms of the construction of a nondeterministic automaton from a grammar; three distinct types of automaton will be discussed. The mechanism of tabulation leads to the...

متن کامل

Parsing and Generation with Tabulation and Compilation

The standard tabulation techniques for logic programming presuppose fixed order of computation. Some data-driven control should be introduced in order to deal with diverse contexts. The present paper describes a data-driven method of constraint transformation with a sort of compilation which subsumes accessibility check and last-call optimization, which characterize standard natural-language pa...

متن کامل

Generalized Chart Algorithm: An Efficient Procedure for Cost-Based Abduction

We present an efficient procedure for cost-based abduction , which is based on the idea of using chart parsers as proof procedures. We discuss in detail three features of our algorithm-goal-driven bottom-up derivation, tabulation of the partial results , and agenda control mechanism-and report the results of the preliminary experiments, which show how these features improve the computational ef...

متن کامل

A Formal Deenition of Bottom-up Embedded Push-down Automata and Their Tabulation Technique

The task of designing parsing algorithms for tree adjoining grammars could be simpliied by providing a separation between the description of the parsing strategy and the execution of the parser. This can be accomplished through the use of Bottom-up Embedded Push-Down Automata. Towards this aim, we provide a formal and consistent deeni-tion of this class of automata and, by removing the nite-sta...

متن کامل

A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique

The task of designing parsing algorithms for tree adjoining grammars could be simplified by providing a separation between the description of the parsing strategy and the execution of the parser. This can be accomplished through the use of Bottom-up Embedded Push-Down Automata. Towards this aim, we provide a formal and consistent definition of this class of automata and, by removing the finite-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Grammars

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2001